On Ramsey-type positional games

نویسندگان

  • Jaroslav Nesetril
  • Tomás Valla
چکیده

Beck introduced the concept of Ramsey games by studying the game versions of Ramsey and van der Waerden theorems. We contribute to this topic by investigating games corresponding to structural extensions of Ramsey and van der Waerden theorems—the theorem of Brauer, structural and restricted Ramsey theorems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Positional games on graphs THESIS SUBMITTED FOR THE DEGREE OF DOCTOR OF PHILOSOPHY by

The theory of Positional Games is an exciting and relatively young area of Combinatorics, though its origins can be traced back to Classical Game Theory. Its goal is to give a mathematical framework for analyzing games of thought. Positional games are strongly related to several other branches of Combinatorics such as Ramsey Theory, Extremal Graph and Set Theory and the Probabilistic Method. Th...

متن کامل

Long cycles in locally expanding graphs, with applications

We provide sufficient conditions for the existence of long cycles in locally expanding graphs, and present applications of our conditions and techniques to Ramsey theory, random graphs and positional games.

متن کامل

Offline thresholds for Ramsey-type games on random graphs

In this paper, we compare the offline versions of three Ramsey-type oneplayer games that have been studied in an online setting in previous work: the online Ramsey game, the balanced online Ramsey game, and the Achlioptas game. The goal in all games is to color the edges of the random graph Gn,m according to certain rules without creating a monochromatic copy of some fixed forbidden graph H. Wh...

متن کامل

Graph Ramsey games

We consider combinatorial avoidance and achievement games based on graph Ramsey theory: The players take turns in coloring still uncolored edges of a graph G, each player being assigned a distinct color, choosing one edge per move. In avoidance games, completing a monochromatic subgraph isomorphic to another graph A leads to immediate defeat or is forbidden and the first player that cannot move...

متن کامل

A new approach to the Ramsey-type games and the Gowers dichotomy in F-spaces

We give a new approach to the Ramsey-type results of Gowers on block bases in Banach spaces and apply our results to prove the Gowers dichotomy in F-spaces.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Journal of Graph Theory

دوره 64  شماره 

صفحات  -

تاریخ انتشار 2010